0.09/0.14 % Problem : Vampire---4.8_27649 : TPTP v0.0.0. Released v0.0.0. 0.09/0.15 % Command : run_E %s %d THM 0.14/0.36 % Computer : n029.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1440 0.14/0.36 % WCLimit : 180 0.14/0.36 % DateTime : Mon Jul 3 13:06:42 EDT 2023 0.14/0.36 % CPUTime : 0.20/0.50 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649 0.20/0.50 # Version: 3.1pre001-ho 0.98/0.62 # Preprocessing class: HSLMSMSSLLLCHSA. 0.98/0.62 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.98/0.62 # Starting lpo1_fix with 540s (3) cores 0.98/0.62 # Starting full_lambda_9 with 180s (1) cores 0.98/0.62 # Starting almost_fo_4 with 180s (1) cores 0.98/0.62 # Starting new_ho_9 with 180s (1) cores 0.98/0.62 # Starting pre_casc_4 with 180s (1) cores 0.98/0.62 # Starting ho_unfolding_6 with 180s (1) cores 0.98/0.62 # full_lambda_9 with pid 27828 completed with status 0 0.98/0.62 # Result found by full_lambda_9 0.98/0.62 # Preprocessing class: HSLMSMSSLLLCHSA. 0.98/0.62 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.98/0.62 # Starting lpo1_fix with 540s (3) cores 0.98/0.62 # Starting full_lambda_9 with 180s (1) cores 0.98/0.62 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.98/0.62 # Search class: HGHSM-FSLM32-DHSMMSBN 0.98/0.62 # partial match(1): HGHSM-FSLM32-MHSMMSBN 0.98/0.62 # Scheduled 12 strats onto 1 cores with 180 seconds (180 total) 0.98/0.62 # Starting full_lambda_5 with 15s (1) cores 0.98/0.62 # full_lambda_5 with pid 27833 completed with status 0 0.98/0.62 # Result found by full_lambda_5 0.98/0.62 # Preprocessing class: HSLMSMSSLLLCHSA. 0.98/0.62 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.98/0.62 # Starting lpo1_fix with 540s (3) cores 0.98/0.62 # Starting full_lambda_9 with 180s (1) cores 0.98/0.62 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.98/0.62 # Search class: HGHSM-FSLM32-DHSMMSBN 0.98/0.62 # partial match(1): HGHSM-FSLM32-MHSMMSBN 0.98/0.62 # Scheduled 12 strats onto 1 cores with 180 seconds (180 total) 0.98/0.62 # Starting full_lambda_5 with 15s (1) cores 0.98/0.62 # Preprocessing time : 0.006 s 0.98/0.62 # Presaturation interreduction done 0.98/0.62 0.98/0.62 # Proof found! 0.98/0.62 # SZS status Theorem 0.98/0.62 # SZS output start CNFRefutation 0.98/0.62 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.98/0.62 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.98/0.62 thf(decl_25, type, in: $i > $i > $o). 0.98/0.62 thf(decl_27, type, emptyset: $i). 0.98/0.62 thf(decl_47, type, ordsucc: $i > $i). 0.98/0.62 thf(decl_61, type, imp: $o > $o > $o). 0.98/0.62 thf(decl_62, type, d_not: $o > $o). 0.98/0.62 thf(decl_67, type, l_or: $o > $o > $o). 0.98/0.62 thf(decl_72, type, l_some: $i > ($i > $o) > $o). 0.98/0.62 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.98/0.62 thf(decl_123, type, nat: $i). 0.98/0.62 thf(decl_124, type, n_is: $i > $i > $o). 0.98/0.62 thf(decl_127, type, n_some: ($i > $o) > $o). 0.98/0.62 thf(decl_130, type, n_1: $i). 0.98/0.62 thf(decl_142, type, n_pl: $i > $i > $i). 0.98/0.62 thf(decl_147, type, diffprop: $i > $i > $i > $o). 0.98/0.62 thf(decl_148, type, d_29_ii: $i > $i > $o). 0.98/0.62 thf(decl_151, type, moreis: $i > $i > $o). 0.98/0.62 thf(decl_155, type, esk1_0: $i). 0.98/0.62 thf(decl_156, type, esk2_0: $i). 0.98/0.62 thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_d_not)). 0.98/0.62 thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_imp)). 0.98/0.62 thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_d_29_ii)). 0.98/0.62 thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_l_or)). 0.98/0.62 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_e_is)). 0.98/0.62 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_all_of)). 0.98/0.62 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_is_of)). 0.98/0.62 thf(def_moreis, axiom, ((moreis)=(^[X1:$i, X187:$i]:((l_or @ ((d_29_ii @ X1 @ X187)) @ ((n_is @ X1 @ X187)))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_moreis)). 0.98/0.62 thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_n_some)). 0.98/0.62 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_n_is)). 0.98/0.62 thf(satz4e, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (ordsucc @ X1) @ (n_pl @ X1 @ n_1))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', satz4e)). 0.98/0.62 thf(satz25a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X225:$i]:((in @ X225 @ nat))) @ (^[X226:$i]:(((moreis @ X226 @ (ordsucc @ X1))<=(d_29_ii @ X226 @ X1)))))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', satz25a)). 0.98/0.62 thf(satz25, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X259:$i]:((in @ X259 @ nat))) @ (^[X260:$i]:(((d_29_ii @ X260 @ X1)=>(moreis @ X260 @ (n_pl @ X1 @ n_1))))))))), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', satz25)). 0.98/0.62 thf(def_n_1, axiom, ((n_1)=(ordsucc @ emptyset)), file('/export/starexec/sandbox/tmp/tmp.zL8yh02gru/Vampire---4.8_27649', def_n_1)). 0.98/0.62 thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])). 0.98/0.62 thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])). 0.98/0.62 thf(c_0_16, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])). 0.98/0.62 thf(c_0_17, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])). 0.98/0.62 thf(c_0_18, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])). 0.98/0.62 thf(c_0_19, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.98/0.62 thf(c_0_20, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.98/0.62 thf(c_0_21, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.98/0.62 thf(c_0_22, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_moreis])). 0.98/0.62 thf(c_0_23, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(apply_def,[status(thm)],[c_0_16, def_n_some])). 0.98/0.62 thf(c_0_24, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17, c_0_15]), c_0_18])). 0.98/0.62 thf(c_0_25, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_19])). 0.98/0.62 thf(c_0_26, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_20, c_0_21])). 0.98/0.62 thf(c_0_27, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_22, c_0_23]), c_0_24]), c_0_25])). 0.98/0.62 thf(c_0_28, plain, ![X560:$i]:(((in @ X560 @ nat)=>((ordsucc @ X560)=(n_pl @ X560 @ n_1)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4e]), c_0_26]), c_0_25])). 0.98/0.62 thf(c_0_29, negated_conjecture, ~(![X418:$i]:(((in @ X418 @ nat)=>![X417:$i]:(((in @ X417 @ nat)=>((l_some @ nat @ (diffprop @ X417 @ X418))=>(~(l_some @ nat @ (diffprop @ X417 @ (ordsucc @ X418)))=>((X417)=(ordsucc @ X418))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz25a])]), c_0_27]), c_0_23]), c_0_26])])). 0.98/0.62 thf(c_0_30, plain, ![X796:$i]:((~(in @ X796 @ nat)|((ordsucc @ X796)=(n_pl @ X796 @ n_1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])). 0.98/0.62 thf(c_0_31, plain, ![X526:$i]:(((in @ X526 @ nat)=>![X525:$i]:(((in @ X525 @ nat)=>((l_some @ nat @ (diffprop @ X525 @ X526))=>(~(l_some @ nat @ (diffprop @ X525 @ (n_pl @ X526 @ n_1)))=>((X525)=(n_pl @ X526 @ n_1)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz25]), c_0_27]), c_0_23]), c_0_26])])). 0.98/0.62 thf(c_0_32, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))&(~(l_some @ nat @ (diffprop @ esk2_0 @ (ordsucc @ esk1_0)))&((esk2_0)!=(ordsucc @ esk1_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])). 0.98/0.62 thf(c_0_33, plain, ![X1:$i]:((((ordsucc @ X1)=(n_pl @ X1 @ n_1))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_30])). 0.98/0.62 thf(c_0_34, plain, ((n_1)=(ordsucc @ emptyset)), inference(split_conjunct,[status(thm)],[def_n_1])). 0.98/0.62 thf(c_0_35, plain, ![X755:$i, X756:$i]:((~(in @ X755 @ nat)|(~(in @ X756 @ nat)|(~(l_some @ nat @ (diffprop @ X756 @ X755))|((l_some @ nat @ (diffprop @ X756 @ (n_pl @ X755 @ n_1)))|((X756)=(n_pl @ X755 @ n_1))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])). 0.98/0.62 thf(c_0_36, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk2_0 @ (ordsucc @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.98/0.62 thf(c_0_37, plain, ![X1:$i]:((((ordsucc @ X1)=(n_pl @ X1 @ (ordsucc @ emptyset)))|~((in @ X1 @ nat)))), inference(rw,[status(thm)],[c_0_33, c_0_34])). 0.98/0.62 thf(c_0_38, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.98/0.62 thf(c_0_39, plain, ![X4:$i, X1:$i]:(((l_some @ nat @ (diffprop @ X4 @ (n_pl @ X1 @ n_1)))|((X4)=(n_pl @ X1 @ n_1))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((l_some @ nat @ (diffprop @ X4 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_35])). 0.98/0.62 thf(c_0_40, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk2_0 @ (n_pl @ esk1_0 @ (ordsucc @ emptyset))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38])])). 0.98/0.62 thf(c_0_41, plain, ![X1:$i, X4:$i]:((((X1)=(n_pl @ X4 @ (ordsucc @ emptyset)))|(l_some @ nat @ (diffprop @ X1 @ (n_pl @ X4 @ (ordsucc @ emptyset))))|~((l_some @ nat @ (diffprop @ X1 @ X4)))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_34]), c_0_34])). 0.98/0.62 thf(c_0_42, negated_conjecture, (l_some @ nat @ (diffprop @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_32])). 0.98/0.62 thf(c_0_43, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.98/0.62 thf(c_0_44, negated_conjecture, ((esk2_0)!=(ordsucc @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_32])). 0.98/0.62 thf(c_0_45, negated_conjecture, ((esk2_0)=(n_pl @ esk1_0 @ (ordsucc @ emptyset))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42]), c_0_43]), c_0_38])])). 0.98/0.62 thf(c_0_46, negated_conjecture, ((ordsucc @ esk1_0)!=(n_pl @ esk1_0 @ (ordsucc @ emptyset))), inference(rw,[status(thm)],[c_0_44, c_0_45])). 0.98/0.62 thf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_37]), c_0_38])]), ['proof']). 0.98/0.62 # SZS output end CNFRefutation 0.98/0.62 # Parsed axioms : 402 0.98/0.62 # Removed by relevancy pruning/SinE : 231 0.98/0.62 # Initial clauses : 296 0.98/0.62 # Removed in clause preprocessing : 60 0.98/0.62 # Initial clauses in saturation : 236 0.98/0.62 # Processed clauses : 547 0.98/0.62 # ...of these trivial : 5 0.98/0.62 # ...subsumed : 105 0.98/0.62 # ...remaining for further processing : 437 0.98/0.62 # Other redundant clauses eliminated : 32 0.98/0.62 # Clauses deleted for lack of memory : 0 0.98/0.62 # Backward-subsumed : 0 0.98/0.62 # Backward-rewritten : 9 0.98/0.62 # Generated clauses : 1485 0.98/0.62 # ...of the previous two non-redundant : 1438 0.98/0.62 # ...aggressively subsumed : 0 0.98/0.62 # Contextual simplify-reflections : 2 0.98/0.62 # Paramodulations : 1205 0.98/0.62 # Factorizations : 2 0.98/0.62 # NegExts : 2 0.98/0.62 # Equation resolutions : 37 0.98/0.62 # Total rewrite steps : 240 0.98/0.62 # Propositional unsat checks : 0 0.98/0.62 # Propositional check models : 0 0.98/0.62 # Propositional check unsatisfiable : 0 0.98/0.62 # Propositional clauses : 0 0.98/0.62 # Propositional clauses after purity: 0 0.98/0.62 # Propositional unsat core size : 0 0.98/0.62 # Propositional preprocessing time : 0.000 0.98/0.62 # Propositional encoding time : 0.000 0.98/0.62 # Propositional solver time : 0.000 0.98/0.62 # Success case prop preproc time : 0.000 0.98/0.62 # Success case prop encoding time : 0.000 0.98/0.62 # Success case prop solver time : 0.000 0.98/0.62 # Current number of processed clauses : 242 0.98/0.62 # Positive orientable unit clauses : 70 0.98/0.62 # Positive unorientable unit clauses: 9 0.98/0.62 # Negative unit clauses : 16 0.98/0.62 # Non-unit-clauses : 147 0.98/0.62 # Current number of unprocessed clauses: 1290 0.98/0.62 # ...number of literals in the above : 5026 0.98/0.62 # Current number of archived formulas : 0 0.98/0.62 # Current number of archived clauses : 173 0.98/0.62 # Clause-clause subsumption calls (NU) : 11235 0.98/0.62 # Rec. Clause-clause subsumption calls : 2680 0.98/0.62 # Non-unit clause-clause subsumptions : 80 0.98/0.62 # Unit Clause-clause subsumption calls : 640 0.98/0.62 # Rewrite failures with RHS unbound : 36 0.98/0.62 # BW rewrite match attempts : 98 0.98/0.62 # BW rewrite match successes : 8 0.98/0.62 # Condensation attempts : 0 0.98/0.62 # Condensation successes : 0 0.98/0.62 # Termbank termtop insertions : 81552 0.98/0.62 0.98/0.62 # ------------------------------------------------- 0.98/0.62 # User time : 0.110 s 0.98/0.62 # System time : 0.009 s 0.98/0.62 # Total time : 0.119 s 0.98/0.62 # Maximum resident set size: 5288 pages 0.98/0.64 0.98/0.64 # ------------------------------------------------- 0.98/0.64 # User time : 0.115 s 0.98/0.64 # System time : 0.013 s 0.98/0.64 # Total time : 0.128 s 0.98/0.64 # Maximum resident set size: 2388 pages 0.98/0.64 % E---3.1 exiting 0.98/0.64 EOF